Experimental Analysis of a Mixed-Mode Parallel Architecture Using Bitonic Sequence Sorting

نویسندگان

  • Samuel A. Fineberg
  • Thomas L. Casavant
  • Howard Jay Siegel
چکیده

Experimentation aimed at determining the potential benefit of mixed-mode SIMD/MIMD parallel architectures is reported. The experimentation is based on timing measurements made on the PASM system prototype at Purdue utilizing carefully coded synthetic variations of a well-known algorithm. The synthetic algorithms used to measure and evaluate this system were based on the bitonic sorting of sequences stored in the processing elements. This computation was mapped to both the SIMD and MIMD modes of parallelism, as well as to two hybrids of the SIMD and MIMD modes. The computations were coded in these four ways and experiments that explore the trade-offs among them were performed. Consideration is given to the overhead caused by enabling or disabling PEs in SIMD mode and a lower bound on this overhead is shown. Finally, a more efficient PE mask generation scheme for multiple “off-the-shelf” microprocessor-based SIMD systems is emulated and its performance is analyzed. The results of these experiments are presented and are discussed with special consideration of the effects of the system’s architecture. The goal is to (as much as possible) obtain implementation independent analyses of the attributes of mixedmode parallel processing with respect to the computational characteristics of the application being examined. The results are used to gain insight into the impact of computation mode on synchronization and data-conditional aspects of system performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Bitonic Sorting∗

Adaptive bitonic sorting is a sorting algorithm suitable for implementation on EREW parallel architectures. Similar to bitonic sorting, it is based on merging, which is recursively applied to obtain a sorted sequence. In contrast to bitonic sorting, it is data dependent. Adaptive bitonic merging can be performed in O ( n p ) parallel time, p being the number of processors, and executes only O (...

متن کامل

Experimental Analysis of a Mixed-Mode Parallel Architecture Performing Sequence Sorting

EXPERIMENTAL ANALYSIS OF A MTXED-MODE PARALLEL ARCHITECTURE PERFORMING SEQUENCE SORTING Samuel A. Fineberg, [email protected] Thomas L. Casavant, tomc@eng. uiowa . edu Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa City, IA 52242 USA Howard Jay Siegel, h j @ecn. purdue . edu Parallel Processing Laboratory School of Electrical En...

متن کامل

A Adaptive Bitonic Sorting

Definition  Adaptive bitonic sorting is a sorting algorithm suitable  for implementation on EREW parallel architectures.  Similar to bitonic sorting, it is based onmerging, which  is recursively applied to obtain a sorted sequence. In  contrast to bitonic sorting, it is data-dependent. Adap tive bitonic merging can be performed inO( p ) parallel  time, p being the number of processors, ...

متن کامل

Fast Parallel Sorting Algorithms on Gpus

This paper presents a comparative analysis of the three widely used parallel sorting algorithms: OddEven sort, Rank sort and Bitonic sort in terms of sorting rate, sorting time and speed-up on CPU and different GPU architectures. Alongside we have implemented novel parallel algorithm: min-max butterfly network, for finding minimum and maximum in large data sets. All algorithms have been impleme...

متن کامل

An Improvement of Bitonic Sorting for Parallel Computing

In this paper we would like to introduce an efficient variant of Bitonic sorting that can be used with sorting large arrays in distributed computing environment. The problem of sorting a collection of values on a mesh-connected distributed-memory computer using our sort algorithm is considered for the case where the number of values exceeds the number of processors in the machine. In this setti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1991